Automated reasoning-alternative methods

Lakatos-style Methods in Automated Reasoning

Algebraic Methods of Automated Reasoning in Monadic Logic

The purpose of this paper is to explain how the theory of Gröbner bases can be used for automated proving in Monadic Logic. The paper is organized as follows: in Section 1 we recall the syntax and semantics of Monadic Logic, and we describe the aim of this paper: the resolution by an algebraic algorithm of the deduction problem in Monadic Logic. Successively, we reduce the deduction problem in ...

Automated Reasoning

Analogy and Automated Reasoning Analogy and Automated Reasoning

We survey the state of the art in the use of analogy in automated reasoning. We are particularly interested in the work of Melis and Whittle (1998). A detailed analysis of their analogy mechanism is given. The problem domain that they tackled is inductive theorems. We examine whether their technique can be used in other problems domains, e.g. in the domain of limit theorems and group theory.

Theory-Specific Automated Reasoning

In designing a large-scale computerized proof system, one is often confronted with issues of two kinds: issues regarding an underlying logical calculus, and issues that refer to theories, either specified axiomatically or characterized by indication of either a privileged model or a family of intended models. Proof services related to the theories most often take the form of satisfiability deci...